Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation

نویسندگان

چکیده

This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. Unlike existing methods that all adopt an off-the-shelf norm without considering special characteristics in MVSC, we design a novel structured tailored to MVSC. Specifically, explicitly impose symmetric constraint and sparse frontal horizontal slices characterize intra-view inter-view relationships, respectively. Moreover, two constraints could be jointly optimized achieve mutual refinement. On basis norm, formulate MVSC as convex recovery problem, which is then efficiently solved with augmented Lagrange multiplier-based method iteratively. Extensive experimental results seven commonly used benchmark datasets show proposed outperforms state-of-the-art significant extent. Impressively, our able produce perfect clustering. In addition, parameters can easily tuned, model robust different datasets, demonstrating its potential practice. The code available at https://github.com/jyh-learning/MVSC-TLRR .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank Multi-view Clustering in Third-Order Tensor Space

The plenty information from multiple views data as well as the complementary information among different views are usually beneficial to various tasks, e.g., clustering, classification, de-noising. Multi-view subspace clustering is based on the fact that the multi-view data are generated from a latent subspace. To recover the underlying subspace structure, the success of the sparse and/or low-r...

متن کامل

Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization

Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. Amon...

متن کامل

Multi-view low-rank sparse subspace clustering

Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...

متن کامل

Iterative Views Agreement: An Iterative Low-Rank Based Structured Optimization Method to Multi-View Spectral Clustering

Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intuitiveness and robustness to noise corruptions. However, it aggressively tries...

متن کامل

Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition

Multi-view clustering, which seeks a partition of the data in multiple views that often provide complementary information to each other, has received considerable attention in recent years. In real life clustering problems, the data in each view may have considerable noise. However, existing clustering methods blindly combine the information from multi-view data with possibly considerable noise...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology

سال: 2021

ISSN: ['1051-8215', '1558-2205']

DOI: https://doi.org/10.1109/tcsvt.2021.3055039